
function bubble_sort!(nums::Vector{Int})
    for i = 1:length(nums)
        for j = 1:(length(nums)-i)
            if(nums[j+1]<nums[j])
                nums[j + 1], nums[j] = nums[j],nums[j+1]
            end
        end
    end 
end 

function choose_sort!(nums::Vector{Int})
    for i = 1:length(nums)
        index = i
        min = nums[i]
        for j = i:length(nums)
            if min > nums[j]
                min = nums[j]
                index = j
            end
        end
        nums[index],nums[i] = nums[i],nums[index]
    end 
end

function insert_sort!(nums::Vector{Int})
    for i = 1:length(nums)
        temp= nums[i]
        j = i - 1
        while(j>1 && nums[j]>temp)
            nums[j+1] = nums[j]
            j -= 1
        end
        nums[j+1] = temp
    end 
end

a = [8, 10, 5, 2, 11, 6, 10, 11, 2]
println("a:",a)
bubble_sort!(a)
println("a:",a)

b = [8, 10, 5, 2, 11, 6, 10, 11, 2]
println("b:",b)
choose_sort!(b)
println("b:",b)

c = [8, 10, 5, 2, 11, 6, 10, 11, 2]
println("c:",c)
insert_sort!(c)
println("c:",c)